On Decompositions of a Cube into Cubes and Simplexes
نویسندگان
چکیده
Some combinatorial results concerning finite decompositions (dissections) of a k-dimensional cube into cubes (respectively, simplexes) of the same dimension are presented in the paper. In connection with such decompositions, the notion of a decomposability number is introduced and the problem of description of all these numbers is discussed. 2000 Mathematics Subject Classification: 52A15, 52B05, 52B10.
منابع مشابه
The intersection problem for cubes
For all integers m, nand t, we determine necessary and sufficient conditions for the existence of (1) a pair of 3-cube decompositions of Kn having precisely t common 3-cubes; and (2) a pair of 3-cube decompositions of Km,n having precisely t common 3-cubes.
متن کاملThe μ-way intersection problem for cubes
A collection of Il 3-cube decompositions of a graph G is said to have intersection size t if there is a set S, with 181 = t, of 3-cubes which is contained in every decomposition, and no 3-cube which is not in S occurs in more than one decomposition. We determine all integers n, t and Il, with Il ::; 12, for which there exists a collection of Il 3-cube decompositions of Kn with intersection size...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملHyper-tubes of hyper-cubes
Hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.
متن کاملDecompositions of Km, n and Kn into cubes
We consider the decomposition of the complete bipartite graph K'm,n into isomorphic copies of a d-cube. We present some general necessary conditions for such a decomposition and show that these conditions are sufficient for d 3 and d = 4. We also explore the d-cube decomposition of the complete graph Kn. Necessary and sufficient conditions for the existence of such a decomposition are known for...
متن کامل